Distributed Relational State Representations for Complex Stochastic Processes
نویسندگان
چکیده
Several promising variants of hidden Markov models (HMMs) have recently been developed to efficiently deal with large state and observation spaces and relational structure. Many application domains, however, have an apriori componential structure such as parts in musical scores. In this case, exact inference within relational HMMs still grows exponentially in the number of components. In this paper, we propose to approximate the complex joint relational HMM with a simpler, distributed one: k relational hidden chains over n states, one for each component. Then, we iteratively perform inference for each chain given fixed values for the other chains until convergence. Due to this structured mean field approximation, the effective size of the hidden state space collapses from O(n) to O(n).
منابع مشابه
Distributed Relational State Representations for Complex Stochastic Processes (Extended Abstract)
Several promising variants of hidden Markov models (HMMs) have recently been developed to efficiently deal with large state and observation spaces and relational structure. Many application domains, however, have an apriori componential structure such as parts in musical scores. In this case, exact inference within relational HMMs still grows exponentially in the number of components. In this p...
متن کاملFirst Order Markov Decision Processes A Dissertation submitted
Relational Markov Decision Processes (RMDP) are a useful abstraction for complex reinforcement learning problems and stochastic planning problems since one can develop abstract solutions for them that are independent of domain size or instantiation. This thesis develops compact representations for RMDPs and exact solution methods for RMDPs using such representations. One of the core contributio...
متن کاملFirst-Order Markov Decision Processes
Markov Decision Processes (MDPs) [7] have developed lately as a standard method for representing uncertainty in decision-theoretic planning. Traditional MDP solution techniques have the drawback that they require an explicit state space, limiting their applicability to real-world problems due to the large number of world states occurring in such problems. Recent work addresses this drawback via...
متن کاملStochastic Relational Processes and Models
In order to solve real-world tasks, intelligent machines need to be able to act in noisy worlds where the number of objects and the number of relations among the objects varies from domain to domain. Algorithms that address this setting fall into the subfield of artificial intelligence known as statistical relational artificial intelligence (StaR-AI). While early artificial intelligence systems...
متن کاملSecond Moment of Queue Size with Stationary Arrival Processes and Arbitrary Queue Discipline
In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...
متن کامل